Breadth-First Heuristic Search
نویسندگان
چکیده
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-conquer solution reconstruction. Computational results show that they outperform other optimal and approximate heuristic search algorithms in solving domain-independent planning problems.
منابع مشابه
BFHSP: A Breadth-First Heuristic Search Planner
Our Breadth-First Heuristic Search Planner (BFHSP) is a domain-independent STRIPS planner that finds sequential plans that are optimal with respect to the number of actions it takes to reach a goal. We developed BFHSP as part of our research on space-efficient graph search. It uses breadth-first search since we found that breadth-first search is more efficient than best-first search when divide...
متن کاملExternal Symbolic Heuristic Search with Pattern Databases
In this paper we propose refinements for optimal search with symbolic pattern databases in deterministic statespace planning. As main memory is limited, external heuristic search is combined with the power of symbolic representation. We start with an external version of symbolic breadth-first search. Then an alternative and external implementation for BDDA* to include different heuristic evalua...
متن کاملDepth-Bound Heuristics and Iterative-Deepening Search Algorithms in Classical Planning
Heuristics play an important role in classical planning. Using heuristics during state space search often reduces the time required to find a solution, but constructing heuristics and using them to calculate heuristic values takes time, reducing this benefit. Constructing heuristics and calculating heuristic values as quickly as possible is very important to the effectiveness of a heuristic. In...
متن کاملA Breadth-First Approach to Memory-Efficient Graph Search
Recent work shows that the memory requirements of A* and related graph-search algorithms can be reduced substantially by only storing nodes that are on or near the search frontier, using special techniques to prevent node regeneration, and recovering the solution path by a divide-and-conquer technique. When this approach is used to solve graph-search problems with unit edge costs, we have shown...
متن کاملA Graph Search Heuristic for Shortest Distance Paths
This paper presents a heuristic for guiding A* search for finding the shortest distance path between two vertices in a connected, undirected, and explicitly stored graph. The heuristic requires a small amount of data to be stored at each vertex. The heuristic has application to quickly detecting relationships between two vertices in a large information or knowledge network. We compare the perfo...
متن کامل